Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[chore] Optimize reduce_32 #918

Merged
merged 3 commits into from
Dec 3, 2024
Merged

[chore] Optimize reduce_32 #918

merged 3 commits into from
Dec 3, 2024

Conversation

nyunyunyunyu
Copy link
Contributor

@nyunyunyunyu nyunyunyunyu commented Dec 2, 2024

Copy link
Contributor

@jonathanpwang jonathanpwang left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I made the static compiler's CastFV more conservative in when it reduces.

@nyunyunyunyu
Copy link
Contributor Author

nyunyunyunyu commented Dec 3, 2024

**jonathanpwang ** left a comment

Hmm that means we will do the conversion even when the felt is just created. I suspect we will never enter the else branch

@jonathanpwang
Copy link
Contributor

**jonathanpwang ** left a comment

Hmm that means we will do the conversion even when the felt is just created. I suspect we will never enter the else branch

I made it do a less than check only in the equal case, but I think we need it otherwise the cast is not deterministic.

@jonathanpwang
Copy link
Contributor

@nyunyunyunyu nyunyunyunyu merged commit ddabf59 into main Dec 3, 2024
6 checks passed
@nyunyunyunyu nyunyunyunyu deleted the chore/optimize-reduce32 branch December 3, 2024 01:33
luffykai pushed a commit that referenced this pull request Dec 13, 2024
* Optimize reduce_32

* safety: static compiler CastFV max_bits bound

* opt: handle equal bits case

---------

Co-authored-by: Jonathan Wang <[email protected]>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants